The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects

Algorithmic Aspects of the S-Labeling Problem

Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation

A k separator k shredder of an undirected graph is a set of k nodes whose removal results in two or more three or more connected components Let the given undirected graph be k node connected and let n denote the number of nodes Solving an open question we show that the problem of counting the number of k separators is P complete However we present an O k n k n time deterministic algorithm for n...

ALGORITHMIC ASPECTS OF LINEAR k-ARBORICITY

For a fixed positive integer k, the linear k-arboricity lak(G) of a graph G is the minimum number ` such that the edge set E(G) can be partitioned into ` disjoint sets, each induces a subgraph whose components are paths of lengths at most k. This paper examines linear k-arboricity from an algorithmic point of view. In particular, we present a linear-time algorithm for determining whether a tree...

Algorithmic aspects of connectivity, allocation and design problems

To those who probably will understand the least, but matter the most. iii ACKNOWLEDGEMENTS First and foremost, I thank my advisor, Vijay Vazirani, for his constant support, advice and help throughout these five years. I hope I have imbibed an of the infinite energy with which he does research. Thanks Vijay for everything! I thank Prasad Tetali for patiently listening to me ranting about my work...

Algorithmic aspects of minus total k-subdomination in graphs